Symbolic computation of divided differences

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...

متن کامل

Fast computation of divided differences and parallel hermite interpolation

We present parallel algorithms for fast polynomial interpolation. These algorithms can be used for constructing and evaluating polynomials interpolating the function values and its derivatives of arbitrary order (Hermite interpolation). For interpolation, the parallel arithmetic complexity is 0(log2 M + log N) for large M and N, where M 1 is the order of the highest derivative information and N...

متن کامل

Divided Differences

Starting with a novel definition of divided differences, this essay derives and discusses the basic properties of, and facts about, (univariate) divided differences. “It belongs to the most beautiful I have been able to do.”[Newton 1676]

متن کامل

Divided differences of implicit functions

Divided differences can be viewed as a discrete analogue of derivatives and are commonly used in approximation theory, see [1] for a survey. Recently, the second author and Lyche established two univariate chain rules for divided differences [2], both of which can be viewed as analogous to Faà di Bruno’s formula for differentiating composite functions [6,7]. One of these formulas was simultaneo...

متن کامل

Challenges of Symbolic Computation

The success of the symbolic mathematical computation discipline is striking. The theoretical advances have been continuous and significant: Gröbner bases, the Risch integration algorithm, integer lattice basis reduction, hypergeometric summation algorithms, etc. From the beginning in the early 1960s, it has been the tradition of our discipline to create software that makes our ideas readily ava...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGSAM Bulletin

سال: 1999

ISSN: 0163-5824

DOI: 10.1145/334714.334716